全文获取类型
收费全文 | 530篇 |
免费 | 14篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 12篇 |
2018年 | 4篇 |
2017年 | 17篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 18篇 |
2013年 | 128篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2008年 | 4篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2002年 | 10篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 14篇 |
1997年 | 9篇 |
1994年 | 5篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1986年 | 16篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 10篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 8篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有544条查询结果,搜索用时 15 毫秒
521.
David J. Lonsdale 《Journal of Military Ethics》2020,19(1):20-39
ABSTRACT Cyber attack against Critical National Infrastructure is a developing capability in state arsenals. The onset of this new instrument in national security has implications for conflict thresholds and military ethics. To serve as a legitimate tool of policy, cyber attack must operate in accordance with moral concerns. To test the viability of cyber attack, this paper provides a new perspective on cyber ethics. Cyber attack is tested against the criteria of the common good. This involves identifying the four core components of the common good from a conflict perspective: respect for the person; social wellbeing; peace and security; and solidarity. The fate of these components is assessed in relation to the six key characteristics of cyber attack from a moral standpoint: security; the role or absence of violence; discrimination; proportionality; cyberharm; and the threshold of conflict. It is concluded that the common good must be incorporated into developing state cyber strategies. 相似文献
522.
523.
524.
Corine M. Laan Ana Isabel Barros Richard J. Boucherie Herman Monsuur Judith Timmer 《海军后勤学研究》2019,66(2):174-190
In this paper, we introduce partially observable agent‐intruder games (POAIGs). These games model dynamic search games on graphs between security forces (an agent) and an intruder given possible (border) entry points and high value assets that require protection. The agent faces situations with dynamically changing, partially observable information about the state of the intruder and vice versa. The agent may place sensors at selected locations, while the intruder may recruit partners to observe the agent's movement. We formulate the problem as a two‐person zero‐sum game, and develop efficient algorithms to compute each player's optimal strategy. The solution to the game will help the agent choose sensor locations and design patrol routes that can handle imperfect information. First, we prove the existence of ?‐optimal strategies for POAIGs with an infinite time horizon. Second, we introduce a Bayesian approximation algorithm to identify these ?‐optimal strategies using belief functions that incorporate the imperfect information that becomes available during the game. For the solutions of large POAIGs with a finite time horizon, we use a solution method common to extensive form games, namely, the sequence form representation. To illustrate the POAIGs, we present several examples and numerical results. 相似文献
525.
526.
We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete Markov process (Pollock, Operat Res 18 (1970) 883–903). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas searching is costly. Moreover, when the agent searches the location that contains the object, he finds it with probability 1 (i.e. there is no overlooking). Waiting can be useful because it could induce a more favorable probability distribution over the two locations next period. We find an essentially unique (nearly) optimal strategy, and prove that it is characterized by two thresholds (as conjectured by Weber, J Appl Probab 23 (1986) 708–717). We show, moreover, that it can never be optimal to search the location with the lower probability of containing the object. The latter result is far from obvious and is in clear contrast with the example in Ross (1983) for the model without waiting. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
527.
528.
James J. Wirtz 《Defense & Security Analysis》2020,36(1):88-100
ABSTRACTA call for innovation as a means to outpace the acceleration of technological change and to bolster capabilities quickly is a central theme of contemporary U.S. Naval Strategy. The need for innovation is accepted, but the integration of readily available technologies into the Fleet is slow. Innovation unfolds according to “Navy-Time,” a cycle lasting between a long-decade and thirty-years. To accelerate the innovation process in the U.S. Navy, the article offers a Concept of Operations for Innovation that outlines how a deliberate process of analysis, weaponisation and integration can move new ideas and weapons into the Fleet in a strategically relevant time-frame. 相似文献
529.
530.